Threshold Voting Is Fundamentally Simpler than Plurality Voting
نویسندگان
چکیده
We show that n-way plurality voting on a large wlOrdered object space has time and space complexities of B(n2) and B(n), respectively. If the object space is ordered, then sorting can be used to reduce the time complexity to the optimal B(nlogn). We then prove that weighted t-out-of-Ev; threshold voting on such an object space has time complexity O(np) and needs working storage space for only p objects, where p = L(Ev;)/tJ. Thus, unless t is very small, threshold voting is considerably simpler than plurality voting. As a corollary, weighted majority voting can be performed in linear time with working storage for a single input object.
منابع مشابه
Voting Algorithms
Sum& Conclusions Voting is important in the realization of ultrareliable systems based on the multi-channel computation paradigm. In an earlier paper (1991 Aug) I dealt with voting networks, viz, hardware implementation of certain voting schemes. A voting algorithm specifies how the voting result is obtained from the input data and can be the basis for implementing a hardware voting network or ...
متن کاملPerformance analysis of pattern classifier combination by plurality voting
Plurality voting is widely used in pattern recognition practice. However, there is little theoretical analysis of plurality voting. In this paper, we attempt to explore the rationales behind plurality voting. The recognition/error/rejection rates of plurality voting are compared with those of majority voting under different conditions. It is demonstrated that plurality voting is more efficient ...
متن کاملVoting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems
some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...
متن کاملVoting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems
some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...
متن کاملMultiple votes, ballot truncation and the two-party system: an experiment
Countries that elect their policy-makers by means of Plurality Voting tend to have a two-party system. We conduct laboratory experiments to study whether alternative voting procedures yield a two-party system as well. Plurality Voting is compared with Approval Voting and Dual Voting, both of which allow voters to vote for multiple candidates, but differ in whether voters are required to cast al...
متن کامل